Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Cutting plane method")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 543

  • Page / 22
Export

Selection :

  • and

Cutting Plane Method for Continuously Constrained Kernel-Based RegressionZHE SUN; ZENGKE ZHANG; HUANGANG WANG et al.IEEE transactions on neural networks. 2010, Vol 21, Num 2, pp 238-247, issn 1045-9227, 10 p.Article

Facet inequalities from simple disjunctions in cutting plane theorySEN, S; SHERALI, H. D.Mathematical programming. 1986, Vol 34, Num 1, pp 72-83, issn 0025-5610Article

On generating cutting planes from combinatorial disjunctionsSHERALI, H. D; SEN, S.Operations research. 1985, Vol 33, Num 4, pp 928-933, issn 0030-364XArticle

A surrogate cutting plane algorithm for all-integer programmingAUSTIN, L. M.Computers & operations research. 1985, Vol 12, Num 3, pp 241-250, issn 0305-0548Article

On the convergence of cutting plane algorithms for a class of nonconvex mathematical programsSEN, S; SHERALI, S. D.Mathematical programming. 1985, Vol 31, Num 1, pp 42-56, issn 0025-5610Article

A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problemsCOLE, F; GOCHET, W; SMEERS, Y et al.Journal of optimization theory and applications. 1985, Vol 47, Num 2, pp 159-180, issn 0022-3239Article

An advanced start algorithm for all-integer programmingHANNA, M. E; AUSTIN, L. M.Computers & operations research. 1985, Vol 12, Num 3, pp 301-309, issn 0305-0548Article

Minimization of Isotonic Functions Composed of FractionsLIN, J.-Y; SCHAIBLE, S; SHEU, R.-L et al.Journal of optimization theory and applications. 2010, Vol 146, Num 3, pp 581-601, issn 0022-3239, 21 p.Article

A cutting plane method for solving KYP-SDPSWALLIN, Ragnar; KAO, Chung-Yao; HANSSON, Anders et al.Automatica (Oxford). 2008, Vol 44, Num 2, pp 418-429, issn 0005-1098, 12 p.Article

Specialized fast algorithms for IQC feasibility and optimization problemsKAO, Chung-Yao; MEGRETSKI, Alexandre; JÖNSSON, Ulf et al.Automatica (Oxford). 2004, Vol 40, Num 2, pp 239-252, issn 0005-1098, 14 p.Article

A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ballBOYD, E. A.Operations research letters. 1997, Vol 20, Num 2, pp 59-63, issn 0167-6377Article

Some facets for an assignment problem with side constraintsRONNY ABOUDI; NEMHAUSER, G. L.Operations research. 1991, Vol 39, Num 2, pp 244-250, issn 0030-364XArticle

Lower subdifferentiable functions and their minimization by cutting planesPLASTRIA, F.Journal of optimization theory and applications. 1985, Vol 46, Num 1, pp 37-53, issn 0022-3239Article

Mixing mixed-integer inequalitiesGÜNLÜK, Oktay; POCHET, Yves.Mathematical programming. 2001, Vol 90, Num 3, pp 429-457, issn 0025-5610Article

Finite master programs in regularized stochastic decompositionHIGLE, J. L; SUVRAJEET SEN.Mathematical programming. 1994, Vol 67, Num 2, pp 143-168, issn 0025-5610Article

Fractional programming by lower subdifferentiability techniquesBONCOMPTE, M; MARTINEZ-LEGAZ, J. E.Journal of optimization theory and applications. 1991, Vol 68, Num 1, pp 95-116, issn 0022-3239Article

Cutting plane and branch and bound for solving a class of scheduling problemsWOLFE, C. S.IIE transactions. 1984, Vol 16, Num 1, pp 50-58, issn 0740-817XArticle

Shallow, deep and very deep cuts in the analytic center cutting plane methodGOFFIN, J.-L; VIAL, J.-P.Mathematical programming. 1999, Vol 84, Num 1, pp 89-103, issn 0025-5610Article

Generalized fractional programming and cutting plane algorithmsBARROS, A. I; FRENK, J. B. G.Journal of optimization theory and applications. 1995, Vol 87, Num 1, pp 103-120, issn 0022-3239Article

Complexity estimates of some cutting plane methods based on the analytic barrierNESTEROV, YU.Mathematical programming. 1995, Vol 69, Num 1, pp 149-176, issn 0025-5610Article

Fenchel cutting planes for integer programsBOYD, E. A.Operations research. 1994, Vol 42, Num 1, pp 53-64, issn 0030-364XArticle

Polyhedral combinatorics in combinatorial optimizationGERARDS, A. M. H; KOLEN, A. W. J.Statistica neerlandica. 1987, Vol 41, Num 1, pp 1-25, issn 0039-0402Article

Solving general continuous single facility location problems by cutting planesPLASTRIA, F.European journal of operational research. 1987, Vol 29, Num 1, pp 98-110, issn 0377-2217Article

Extensions of a theorem of BalasBLAIR, C. E; JEROSLOW, R. G.Discrete applied mathematics. 1984, Vol 9, Num 1, pp 11-26, issn 0166-218XArticle

Scatter search for project scheduling with resource availability costSATO YAMASHITA, Denise; AMARAL ARMENTANO, Vinicius; LAGUNA, Manuel et al.European journal of operational research. 2006, Vol 169, Num 2, pp 623-637, issn 0377-2217, 15 p.Article

  • Page / 22